Handling of Infinitives in English to Sanskrit Machine Translation

نویسندگان

  • Vimal Mishra
  • R. B. Mishra
چکیده

The development of Machine Translation (MT) system for ancient language like Sanskrit is a fascinating and challenging task. In this paper, the authors handle the infinitive type of English sentences in the English to Sanskrit machine translation (EST) system. The EST system is an integrated model of a rule-based approach of machine translation with Artificial Neural Network (ANN) model that translates an English sentence (source sentence) into the equivalent Sanskrit sentence (target sentence). The authors use feed forward ANN for the selection of Sanskrit words, such as nouns, verbs, objects, and adjectives, from English to Sanskrit User Data Vector (UDV). Due to morphological richness of Sanskrit, this system uses only morphological markings to identify Subject, Object, Verb, Preposition, Adjective, Adverb, Conjunctive and as well as an infinitive types of sentence. The performance evaluations of our EST system with different methods of MT evaluations are shown using a table. analyzers have done earlier which is briefly described below. The work of Ramanujan (1992) describes that morphological analysis of Sanskrit is the basic requirement for the computer processing of Sanskrit. The Nyaya (Logic), Vyakarana (Grammar) and Mimamsa (Vedic interpretation) are suitable solutions that cover syntactic, semantic and contextual analysis of Sanskrit sentence. P. Ramanujan has developed a Sanskrit parser ‘DESIKA’, which is Paninian grammar based analysis program. DESIKA1 includes vedic processing and shabda-bodha. Briggs (1985) uses semantic nets (knowledge representation scheme) to analyze sentences unambiguously. He compares the similarity DOI: 10.4018/jalr.2010070101 2 International Journal of Artificial Life Research, 1(3), 1-16, July-September 2010 Copyright © 2010, IGI Global. Copying or distributing in print or electronic forms without written permission of IGI Global is prohibited. between English to Sanskrit and provides the theoretical implications of their equivalence. Huet (2003) has developed a Grammatical Analyzer System, which tags NPs (Noun Phrase) by analyzing sandhi, samasa and sup affixation2. The works in Sanskrit processing tools and Sanskrit authoring system have carried out Jawaharlal Nehru University, New Delhi-India3. It is currently engaged in karaka Analyzer, sandhi splitter and analyzer, verb analyzer, NP gender agreement, POS tagging of Sanskrit, online Multilingual amarakosa, online Mahabharata indexing and a model of Sanskrit Analysis System (SAS) (Jha et al., 2006). Morphological analyzers for Sanskrit have developed by Akshara Bharathi Group at Indian Institute of Technology, Kanpur-India, and University of Hyderabad. We have developed a prototype model of English to Sanskrit machine translation (EST) system using ANN model and rule based approach. ANN model gives matching of equivalent Sanskrit word of English word which handles noun and verb. The ANN based system gives us faster matching of English noun (subject or object) or verb to appropriate Sanskrit noun (subject or object) or dhaatu. The rule based model generates Sanskrit translation of the given input English sentence using rules that generate verb and noun for Sanskrit. The rule based approaches mostly make use of hand written transfer rules to the translation of substructures from source language (English sentence) to target language (Sanskrit sentence). The main advantages of rule based approaches are easy implementation and small memory requirement (Jain et al., 2001). We have divided our work into the following sections. Section 2 describes the linguistic feature of Sanskrit, its equivalence in English and comparative view of English and Sanskrit. Section 3 presents infinitives in English and Sanskrit that describe the rules for forming words of infinitives in Sanskrit which is based on Panini grammar. Section 4 describes the system model of our EST system. Section 5 presents implementation and the illustration with examples as well as the result of the translation in GUI form. In section 6, we show the performance evaluation results of our EST system with different MT evaluation methods such as BLEU (BiLingual Evaluation Understudy), unigram Precision, unigram Recall, F-measure and METEOR score using table. The conclusions and scope for future work are mentioned in Section 7. 2. LInguIStIc FeAtureS oF SAnSkrIt And ItS equIvALence In engLISh The Sanskrit language is called as “devbhashaa” which means the language of God. The Sanskrit language is written in devnagari script. The Sanskrit language have forty-two characters or varnas which have thirty-three vyanjanas or consonants and nine swaras or vowels (Kale, 2005). In Sanskrit, there are six tenses (kala) and four moods (arthaa). The tenses are: Present, Aorist, Imperfect, Perfect, First Future and Second Future. The moods are: Imperative, Potential, Benedictive and Conditional. The ten tenses and moods are technically called the ten Lakaaras in Sanskrit grammar. There are three numbers: singular, dual and plural. The singular stands for one; dual for two and plural for more than two. There are three person in English grammar: first, second and third. Thus, Sanskrit grammar has structural vastness. Besides its structural vastness, Sanskrit grammar is very well organized and least ambiguous compared to other natural languages, illustrated by the fact of increasing fascination for this ancient Aryan language. According to Paninian grammar, Sanskrit grammar possesses well organized rules and Meta rules. We describe some of salient feature regarding the nature of the Sanskrit that is given below. (a) All words made of characters either vowel (swaras) or consonants (vyanjanas). swaras exits independently while vyanjanas depend on swaras. (b) Words consist of two parts: a fixed base part and a variable affix part. The variable 14 more pages are available in the full version of this document, which may be purchased using the "Add to Cart" button on the product's webpage: www.igi-global.com/article/handling-infinitives-englishsanskrit-machine/46024?camid=4v1 This title is available in InfoSci-Journals, InfoSci-Journal Disciplines Medicine, Healthcare, and Life Science. Recommend this product to your librarian: www.igi-global.com/e-resources/libraryrecommendation/?id=2

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ANN and Rule Based Model for English to Sanskrit Machine Translation

The development of Machine Translation system for ancient language such as Sanskrit language is much more fascinating and challenging task. Due to lack of linguistic community, there are no wide work accomplish in Sanskrit translation while it is mother language by virtue of its importance in cultural heritage of India. In this paper, we integrate a traditional rule based approach of machine tr...

متن کامل

A Study towards Design of an English to Sanskrit Machine Translation System

We are experimenting to examine how AnglaBharati system designed to translate English to Indian languages could be adapted for translation to Sanskrit. The main contribution of our work is demonstration of machine translation of English to Sanskrit for simple sentences based on PLIL generated by AnglaBharati and Ashtadhyayi rules. Presently our translation system caters to affirmative, negative...

متن کامل

Divergence patterns between English and Sanskrit Machine Translation

The translation divergence is a challenging problem in the area of machine translation. A detailed study of divergence issues in machine translation is required for their proper classification and detection. The language divergences between English and Sanskrit can be considered as representing the divergences between SVO (Subject Verb Object) and SOV (Subject Object Verb) classes of languages....

متن کامل

English Speech to Sanskrit Speech (ESSS) using Rule based Translation

The development of such system that automatically recognizes the input speech and translates in another language like Sanskrit is a challenging task. Sanskrit language is much more conjured language. The purpose of this paper is to explain a system which convert the English Speech into English text and then translate that English text into Sanskrit text and again convert that into speech. This ...

متن کامل

Some notes on Russian predicative infinitives in automatic translation

Some considerations are presented regarding certain aspects of automatically translating Russian predicative infinitives into English. Emphasis is placed on the analysis (decoding) of the pertinent infinitive constructions in the source language rather than on the synthesis (encoding) of their equivalents in the target language. The paper does not aim at an exhaustive treatment of the problem, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IJALR

دوره 1  شماره 

صفحات  -

تاریخ انتشار 2010